• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > Çѱ¹Á¤º¸Åë½ÅÇÐȸ Çмú´ëȸ > 2008³â Ãá°èÇмú´ëȸ

2008³â Ãá°èÇмú´ëȸ

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) A Study of Ordering Sphere Decoder Class for Space-Time Codes
¿µ¹®Á¦¸ñ(English Title) A Study of Ordering Sphere Decoder Class for Space-Time Codes
ÀúÀÚ(Author) Van-Su Pham   Linh Mai   S.M. Humayun Kabir   Giwan Yoon  
¿ø¹®¼ö·Ïó(Citation) VOL 12 NO. 01 PP. 0567 ~ 0571 (2008. 05)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.
Å°¿öµå(Keyword) Space-Time Code   Multiple-input Multiple-output (MIMO) system   Sphere Decoder   Ordering   Optimal Detection   Wireless Communication  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå